A Power-aware Post-processing under depth constraint for LUT-based FPGA Technology Mapping

نویسندگان

  • Taiga Takata
  • Yusuke Matsunaga
چکیده

It is difficult for LUT-based FPGA technology mapping to generate a power-minimal K-input LUT network with minimum depth at one time because a problem for power-minimization was shown to be NP-hard[5]. A problem for area-minimization is also NP-hard, and area-aware algorithms[7][8][9][10] recover area after generating a depthminimum network. On the other hand, existing poweraware algorithms[11][12][13][14] finish with generating a depthminimum network whose power is small. There might be room for power improvement for the generated network. This paper presents a post-processing to minimize power under depth constraint for LUT-based FPGA technology mapping. The proposed algorithm is a power-aware application of Cut Resubstitution[6] which is a post-processing to minimize area under depth constraint. Experimental results show that a simple depth-minimum mapper followed by the proposed algorithm generates networks whose total switching activity is 21% smaller and dynamic power is 10% smaller than that generated by Emap[13] for the input size of LUT K = 4. The results also show that total switching activity is associated with dynamic power. The proposed method generated networks whose total switching activity is 24%, 27% smaller than that generated by Emap on average for K = 5, 6, respectively. The proposed algorithm runs in practical run-time for all the case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power-Aware, Depth-Optimum and Area Minimization Mapping of K- LUT Based FPGA Circuits

This paper introduces an efficient application intended for mapping under complex criteria applied to K-LUT based FPGA implemented circuits. This application is based on an algorithm that was developed taking into consideration a significant design factor power consumption. Power consumption is considered in addition to other design factors that are traditionally used. To increase performance, ...

متن کامل

Power-aware technology mapping for LUT-based FPGAs

We present a new power-aware technology mapping technique for LUT-based FPGAs which aims to keep nets with high switching activity out of the FPGA routing network and takes an activity-conscious approach to logic replication. Logic replication is known to be crucial for optimizing depth in technology mapping; an important contribution of our work is to recognize the effect of logic replication ...

متن کامل

Heuristic Performance Optimal and Power Conscious for K-LUT Based FPGA Technology Mapping

In this paper is presented a new approach for decreasing the power consumption in LUT based FPGA implemented circuits. The attempt is based on reducing logic activity among LUTs. In order to achieve this target it was used the probability approach that estimates the dynamic logic activity of each line in the circuit. Traversing circuits from primary inputs lines to the primary output lines, ste...

متن کامل

FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs

This paper represents pioneering work in the area of technology mapping for FPGAs and presents a theoretical breakthrough by solving the LUT-­‐based FPGA technology mapping problem for depth minimization optimally in polynomial time. The key idea was to model the LUT mapping problem as the computation of a minimum-­‐height, K-­‐feasible cut. This was the first global formulation of the LUT mapp...

متن کامل

Cutless FPGA Mapping

The paper presents a new algorithm for FPGA technology mapping into K-input LUTs. The algorithm avoids cut enumeration by incrementally computing and updating one good K-feasible cut at each node of the subject graph. The main advantage of the algorithm is that it works for very large LUT size while offering dramatic improvements in memory and runtime. For 10-input LUTs, the memory is reduced 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009